Odd-even, compare-exchange parallel sorting
نویسندگان
چکیده
We present a parallel sorting algorithm and its proof which sorts a sequence of n elements in time O(logz n) with n/2 processors on an EREW-PRAM computational model. A sorting network directly implements the algorithm using O(n .log n)PEs. The algorithm is based on the elementary Compare-Exchange operation and has the advantage that it does not require a powerful computational model, uses the least amount of space for the sorting problem, has small constants and can be implemented directly on a sorting network. Furthermore, the architecture of the network is simple and makes no unrealistic technological assumptions .
منابع مشابه
Area Efficient Sorting Unit Using Scalable Digital CMOS Comparator
Sorting is the process of arranging the data into a meaningful order so that we can analyze it more effectively. Sorting is a key requirement in many applications like digital signal processing, scientific computing, network processing etc. This paper presents an area efficient technique for designing high throughput and low latency sorting units. Two popular parallel sorting algorithms are u...
متن کاملSorting algorithms based on the odd-even transposition sort and the shearsort with DNA strands
In recent works for high performance computing, computation with DNA molecules, that is, DNA computing, has considerable attention as one of non-silicon based computing. In this paper, we propose two procedures for sorting with DNA strands. An input of the algorithms is a set of binary numbers of bits, which are denoted by kinds of DNA strands. We first propose a procedure for the compare-and-e...
متن کاملA Version of Parallel Odd-Even Sorting Algorithm Implemented in CUDA Paradigm
Sorting data is an important problem for many applications. Parallel sorting is a way to improve sorting performance using more nodes or threads e.g. dividing data in more nodes and perform sorting in each node simultaneously or including more threads in process of sorting. It was experimented with one type of those sorting algorithms, namely the well-known sorting algorithms called Odd-Even so...
متن کاملOn Batcher's Merge Sorts as Parallel Sorting Algorithms
In this paper we examine the average running times of Batcher's bitonic merge and Batcher's odd-even merge when they are used as parallel merging algorithms. It has been shown previously that the running time of odd-even merge can be upper bounded by a function of the maximal rank diierence for elements in the two input sequences. Here we give an almost matching lower bound for odd-even merge a...
متن کاملOdd-Even Sort in Powerlists
In 6] Misra introduced the powerlist notation and used it to succintly describe several parallel algorithms. In particular, algorithms that use a balanced divide and conquer strategy have elegant descriptions as powerlist functions. Among the examples presented were two sorting networks due to Batcher 1]. To prove their correctness a-posteriori, Misra used the 0-1 principle, which states that a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Microprocessing and Microprogramming
دوره 40 شماره
صفحات -
تاریخ انتشار 1994